A remark on the computation of cube roots in finite fields

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

A Remark on a Remark by Macaulay or Enhancing Lazard Structural Theorem

3D Gabor Based Hyperspectral Anomaly Detection

Hyperspectral anomaly detection is one of the main challenging topics in both military and civilian fields. The spectral information contained in a hyperspectral cube provides a high ability for anomaly detection. In addition, the costly spatial information of adjacent pixels such as texture can also improve the discrimination between anomalous targets and background. Most studies miss the wort...

A remark on asymptotic enumeration of highest weights in tensor powers of a representation

We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...

Theoretical Comparison of Root Computations in Finite Fields

In the paper [4], the authors generalized the CipollaLehmer method [2], [5] for computing square roots in finite fields to the case of r-th roots with r prime, and compared it with the AdlemanManders-Miller method [1] from the experimental point of view. In this paper, we compare these two methods from the theoretical point of view. key words: root computation, finite field, complexity